projection n. 1.射出,投擲,發射,噴射。 2.投射;投影,投影法;(地圖)投影圖制法;【電影】放映。 3.凸出;凸出部;凸出物。 4.設計,規劃,計劃。 5.(根據已知資料或觀察所作的)預測,推測,估計。 6.【心理學】投射;(思想等的)形象化,具體化。 7.【心理學】想像。 8.【冶金】金屬的嬗變。 central [perspective] projection 透視投影。 orthogonal [oblique] projection 正[斜]投影。 a projection booth [room] 〔美國〕放映室。 a projection machine 放映機。 a projection lantern 幻燈,映畫器。 the projection of the lower lip 下唇凸出。 n. -ist 1. 制投影圖的人;地圖繪制者。 2. 電影[幻燈]放映員;電視播放員。
gradient adj. 1.傾斜的。 2.【動物;動物學】步行的,能步行的。 n. 1.〔英國〕(道路的)傾斜度,坡度,坡路。 2.【物理學】梯度,陡度,(溫度、氣壓等的)變化率,梯度變化曲線。
General gradient projection method of interior points for linear coustrained optimization 一個求解線性不等式約束的非線性規劃的廣義梯度投影內點算法
Generalized three term - memory gradient projection method for nonlinear programming with nonlinear equality and inequality constraints 求解非線性等式和不等式約束優化問題的三項記憶梯度廣義投影算法
Some convergence results of the gradient projection in method under milder conditions are obtained . finally we conclude the dissertation with some remarks in chapter 6 第六章是結論部分,主要對本論文的內容作了簡單的概括和分析。
Then based on the gradient projection method , the gradient projection direction is deduced . the gradient direction is the base for sensitivity analysis 接著,根據投影梯度法,推導出了投影梯度方向,該梯度方向是靈敏度分析的基礎。
Chapter 2 , using the technique of ( e , d ) generalized gradient projection and the idea of strongly subfeasible directions , several new algorithms for systems of nonlinear inequations are presented 第二章,利用( , )廣義梯度投影技術和強次可行方向法思想,建立了非線性不等式組的廣義梯度投影算法。
In chapter 2 . we give a class of new algorithms for nonlinear programming problems with linear constrained by combining the gradient projection method with non - quasi - newton method which was given in paper [ 2 ] . it ' s global convergence and the superlinear convergence are proved under suitable conditions 在第二章中我們將梯度投影與文[ 2 ]中的非擬牛頓法相結合,給出了求解線性約束非線性優化問題的一類梯度投影非擬牛頓算法。
According to the geometry model constructed in this paper , kinematics analysis , inverse kinematics with its optimization , analysis and calculation of dynamics are introduced . the resolution of matrix reverse transformation and gradient projection based on fake reverse matrix are used in the computation 建立了該手腕的幾何模型,針對該模型展開了運動學分析、逆運動學解的計算,計算使用了矩陣逆變換的解析法和基于偽逆陣的梯度投影法兩種方法。
2 both least mean - square ( lms ) and least - square ( ls ) blind space - time receivers methods based on the rosen ' s gradient projection are presented for space - time receiver that merge with the idea of smart antenna , and combined with the different data - selected schemes . the effect of these schemes on the computational complexity of two detection methods is analyzed . the simulations illustrate that those methods are effective 2 、針對將智能天線的思想融入其中的空時接收機,提出了基于rosen梯度投影實現的最小均方( lms )與最小二乘盲空時接收機算法并將提出的不同數據方案結合起來,分析了提出的方案對每次迭代運算的運算量的影響,通過仿真實驗驗證了方法的有效性。
3 a novel recursive least - square ( rls ) blind space - time receiver algorithm based on the constrained condition , which can completely avoid the matrix inversion introduced into by constraints ( comparing with the normal rls ) , is proposed for multi - path slow fading cdma channels . the computational complexity of this method is not only lower than that of the normal rls , but also lower than that of both lms and ls blind space - time receiver methods that are realized based on the rosen ' s gradient projection . and the speed of convergence of the presented rls blind space - time receiver algorithm is better than that of both lms and ls blind space - time receiver methods 3 、針對多徑慢衰落信道下ds - cdma盲空時接收機中線性約束二次規劃問題提出一種新的遞歸最小二乘算法,該算法完全避免因約束而引進的矩陣求逆運算(相對于常規的遞歸最小二乘算法) ,不但運算量比常規的要低,而且比基于rosen梯度投影實現的最小均方( lms )與最小二乘盲空時接收機算法還低,且收斂速度比基于rosen梯度投影實現的最小均方( lms )與最小二乘盲空時多用戶檢測都好,將提出的新的遞歸最小二乘算法與提出的數據選擇方案結合起來可以進一步降低其運算量,具有很大的實用價值,最后通過仿真實驗進一步分析了其性能。
Used perturbed method and making inexact generalized gradient projection with cone , perturbed generalized gradient projection method is proposed . the field of the algorithm is extended . numerical experiments show that the method is effective . secondly , using the trust region form and the pseudo - directional derivative of minimax problem , we propose the trust region form of minimax problem 對信賴域法作了進一步的研究,借助minimax問題的偽方向導數,構造出其信賴域二次模型,并結合非單調策略,給出求解minimax問題的簡單易行的信賴域算法。